A General Bottom-up Procedure for Searching And/Or Graphs
نویسنده
چکیده
This paper summarizes work on a general bottomup procedure for searching AND/OR graphs which includes a number of procedures for searching AND/OR graphs, state-space graphs, and dynamic programming procedures as its special cases. The paper concludes with comments on the significance of this work in the context of the author’s unified approach to search procedures.
منابع مشابه
A general heuristic bottom-up procedure for searching and/or graphs
This paper presents a general heuristic bottom-up procedure for finding a least-cost solution tree of an AND/OR graph when the cost functions associated with the arcs are monotone. Since monotone cost functions are very general, the procedure is applicable to a very large number of problems. The procedure works for both cyclic and acyclic AND/OR graphs, and subsumes most of the known bottom-up ...
متن کاملStudy of Torque, Drag and Hydraulics of a Deviated Drilled Well using Drilling Office Software
Rotational drilling was a revolution in drilling technology. It made the drilling process more efficient and faster and more depth of well could be achieved through rotation method. Besides all of its advantages, the rotation approach induced some problems like pipe sticking and downhole cleaning to the drilling procedure. Hole cleaning and reduction of torque and drag seems to be vital in incl...
متن کاملEvent-Related Potentials of Bottom-Up and Top-Down Processing of Emotional Faces
Introduction: Emotional stimulus is processed automatically in a bottom-up way or can be processed voluntarily in a top-down way. Imaging studies have indicated that bottom-up and top-down processing are mediated through different neural systems. However, temporal differentiation of top-down versus bottom-up processing of facial emotional expressions has remained to be clarified. The present st...
متن کاملThe Generalized A* Architecture
We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules. A large variety of inference problems in AI can be formulated in this framework. We generalize A* search and heuristics derived from abstractions to a broad class of lightest derivation problems. We also describe a new algorithm that searches for lightest derivations using a hierarchy...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984